Computing the minimum distance between two Bézier curves
نویسندگان
چکیده
منابع مشابه
Computing the Fréchet distance between two polygonal curves
Computing the Fréchet distance between two polygonal curves H Alt, M Godau International Journal of Computational Geometry & ..., 1995 World Scientific As a measure for the resemblance of curves in arbitrary dimensions we consider the socalled Fréchet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q consisting of p and q edges an algorithm of runti...
متن کاملComputing the Hausdorff distance between two B-spline curves
This paper presents a geometric pruning method for computing the Hausdorff distance between two B-spline curves. It presents a heuristic method for obtaining the one-sided Hausdorff distance in some interval as a lower bound of the Hausdorff distance, which is also possibly the exact Hausdorff distance. Then, an estimation of the upper bound of the Hausdorff distance in an sub-interval is given...
متن کاملComputing the Minimum Directional Distance between Two Convex Polyhedra
Given two convex polyhedra P and Q and a direction s, the minimum directional distance (MDD) is defined to be the shortest translational distance along the direction s that is required to make P and Q just in contact. In this paper we propose a novel method, called MDD-DUAL , for computing the MDD between two convex polyhedra. The MDD is equivalent to the shortest distance between the origin an...
متن کاملThe CAT Bézier Curves
A class of cubic Bézier-type curves based on the blending of algebraic and trigonometric polynomials, briefly CAT Bézier curves, is presented in this paper. The CAT Bézier curves retain the main superiority of cubic Bézier curves. The CAT Bézier curves can approximate the Bézier curves from the both sides, and the shapes of the curves can be adjusted totally or locally. With the shape parameter...
متن کاملComputing the Fréchet distance between piecewise smooth curves
We consider the Fréchet distance between two curves which are given as a sequence of m + n curved pieces. If these pieces are sufficiently wellbehaved, we can compute the Fréchet distance in O(mn log(mn)) time. The decision version of the problem can be solved in O(mn) time. The results are based on an analysis of the possible intersection patterns between circles and arcs of bounded curvature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.10.050